On cycles in regular 3-partite tournaments
نویسندگان
چکیده
منابع مشابه
Notes on cycles through a vertex or an arc in regular 3-partite tournaments
We shall assume that the reader is familiar with standard terminology on directed graphs (see, e.g., Bang-Jensen and Gutin [1]). In this note, if we speak of a cycle, then we mean a directed cycle. If xy is an arc of a digraph D, then we write x → y and say x dominates y. If X and Y are two disjoint vertex sets of a digraph D such that every vertex of X dominates every vertex of Y , then we say...
متن کاملWhen n-cycles in n-partite tournaments are longest cycles
An n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy in 1976 that every strongly connected n-partite tournament has an n-cycle. We characterize strongly connected n-partite tournaments in which a longest cycle is of length n and, thus, settle a problem in L. Volkmann, Discrete Math. 245 (2002) 19-53.
متن کاملHamiltonian Cycles in Regular Tournaments
We show that every regular tournament on n vertices has at least n!/(2+o(1)) Hamiltonian cycles, thus answering a question of Thomassen [17] and providing a partial answer to a question of Friedgut and Kahn [7]. This compares to an upper bound of about O(nn!/2) for arbitrary tournaments due to Friedgut and Kahn (somewhat improving Alon’s bound of O(nn!/2)). A key ingredient of the proof is a ma...
متن کاملOn 4-cycles and 5-cycles in Regular Tournaments
First, some definitions. A tournament is regular of degree k if each point has indegree k and outdegree k: clearly such a tournament has 2k +1 points. The trivial tournament has just one point. A tournament T is doubly regular with subdegree t if it is non-trivial and any two points of T jointly dominate precisely t points; equivalently if T is non-trivial and for each point v of T, the subtour...
متن کاملThe tight bound on the number of C_3-free vertices on regular 3-partite tournaments
Let T be a 3-partite tournament. We say that a vertex v is −→ C3-free if v does not lie on any directed triangle of T . Let F3(T ) be the set of the −→ C3-free vertices in a 3-partite tournament and f3(T ) its cardinality. In a recent paper, it was proved that if T is a regular 3-partite tournament, then f3(T ) < n 9 , where n is the order of T . In this paper, we prove that f3(T ) ≤ n 12 . We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.11.028